Multi-agent nomadic routes network planning considering grassland-livestock balance
نویسندگان
چکیده
منابع مشابه
Multi-agent Path Planning and Network Flow
This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the later, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invaria...
متن کاملOptimization and Planning of Emergency Evacuation Routes Considering Traffic Control
Emergencies, especially major ones, happen fast, randomly, as well as unpredictably, and generally will bring great harm to people's life and the economy. Therefore, governments and lots of professionals devote themselves to taking effective measures and providing optimal evacuation plans. This paper establishes two different emergency evacuation models on the basis of the maximum flow model (M...
متن کاملTotal-Order Multi-Agent Task-Network Planning for Contract Bridge
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent information about bridge in a task network that is extended to represent multi-agency and uncertainty. Our game-playing procedure uses this task network to generate game trees in which the set of alternative choices is deter...
متن کاملMulti-Agent Transport Planning
We discuss a distributed transport planning problem with competitive autonomous actors that carry out time-constrained pick-up delivery orders from customers. The agents have to find conflict-free routes to execute a series of orders they have accepted. Hatzack and Nebel [2] were the first to suggest that finding such a conflict-free schedule can be reduced to solving a job shop scheduling prob...
متن کاملHybrid Multi-agent Planning
Although several approaches have been constructed for multi-agent planning, solving large planning problems is still quite difficult. In this paper, we present a new approach that integrates landmark preprocessing technique in the context of hierarchical planning with multi-agent planning. Our approach uses Dependent and Independent clustering techniques to break up the planning problem into sm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.12.041